Distance domination and amplifier placement problems
نویسندگان
چکیده
منابع مشابه
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents e-cient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملRandom-walk domination in large graphs: problem definitions and fast solutions
We introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social network, Ads-placement problem in advertisement networks, and resourceplacement problem in P2P networks). Specifically, given a graph G, the goal of the first type of random-walk domination problem is to target k nodes...
متن کاملDesign of an S-band Ultra-low-noise Amplifier with Frequency Band Switching Capability
In this paper, an ultra-low-noise amplifier with frequency band switching capability is designed, simulated and fabricated. The two frequency ranges of this amplifier consist of the 2.4 to 2.5 GHz and 3.1 GHz to 3.15 GHz frequency bands. The designed amplifier has a noise figure of less than 1dB, a minimum gain of 23 dB and a VSWR of less than 2 in the whole frequency band. The design process s...
متن کاملComparison of Tourism Placement and Development Models from Land Use Planning perspective in Zagros Forests Case Study: Javanrud County
While in recent years, due to numerous reasons, the amount of travel and tourism has increased, the amount of problems caused by this activity is also considered by managers. By using presence points of tourists in Javanrud County, Analytic hierarchy process (AHP) and Random Forest (RF) models, the conditions of establishment of tourists from the aspect of land use planning was investigated. In...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 34 شماره
صفحات -
تاریخ انتشار 2006